Three-time-level methods for the numerical solution of soil freezing problems
نویسندگان
چکیده
منابع مشابه
Trigonometrically fitted two-step obrechkoff methods for the numerical solution of periodic initial value problems
In this paper, we present a new two-step trigonometrically fitted symmetric Obrechkoff method. The method is based on the symmetric two-step Obrechkoff method, with eighth algebraic order, high phase-lag order and is constructed to solve IVPs with periodic solutions such as orbital problems. We compare the new method to some recently constructed optimized methods from the literature. The numeri...
متن کاملNumerical Solution of One-Dimensional Stefan-Like Problems Using Three Time-Level Method
We introduce formulation based on three timelevel finitedifference method for onedimensional Stefanlike problems. Matrix method stability analysis of equations is also investigated. The computational results obtained by the present method are in excellent agreement with the results reported previously by the other authors.
متن کاملVariational methods for the numerical solution of nonlinear elliptic problems
Some people may be laughing when looking at you reading in your spare time. Some may be admired of you. And some may want be like you who have reading hobby. What about your own feel? Have you felt right? Reading is a need and a hobby at once. This condition is the on that will make you feel that you must read. If you know are looking for the book enPDFd variational methods for the numerical so...
متن کاملThe symmetric two-step P-stable nonlinear predictor-corrector methods for the numerical solution of second order initial value problems
In this paper, we propose a modification of the second order method introduced in [Q. Li and X. Y. Wu, A two-step explicit $P$-stable method for solving second order initial value problems, textit{Appl. Math. Comput.} {138} (2003), no. 2-3, 435--442] for the numerical solution of IVPs for second order ODEs. The numerical results obtained by the new method for some...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cold Regions Science and Technology
سال: 1980
ISSN: 0165-232X
DOI: 10.1016/0165-232x(80)90030-0